Back to course home
0% completed
Vote For New Content
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Oracle Hard
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Find Subsequence of Length K With the Largest Sum (easy)
Problem Statement
Given an integer array nums and a positive integer k, return any subsequence of nums of length k, which has the largest sum.
A subsequence maintains the original order of array elements but may exclude some, without reordering the remaining ones.
Examples
-
Example 1:
- Input:
nums = [5, -2, 3, 8], k = 2 - Expected Output:
[5, 8] - Justification: The subsequence
[5, 8]gives the largest sum of13, which is the maximum sum we can obtain from any subsequence of length2.
- Input:
-
Example 2:
- Input:
nums = [-1, -2, -3, -4], k = 3 - Expected Output:
[-1, -2, -3] - Justification: Although all numbers are negative, the subsequence
[-1, -2, -3]has the least negative sum, making it the largest sum (-6) for a length of3.
- Input:
-
Example 3:
- Input:
nums = [4, 3, 1, 2, 5], k = 4 - Expected Output:
[4, 3, 2, 5] - Justification: The subsequence
[4, 3, 2, 5]sums up to14, which is the highest possible sum for any subsequence of length4in the given array.
- Input:
Try it yourself
Try solving this question here:
Java
. . . .
Solution: Degree of an Array
Solution: Find Subsequence of Length K With the Largest Sum
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself